Constraint weighting and constraint domination: a formal comparison

نویسنده

  • Jie Zhang
چکیده

The advent of Optimality Theory has revived the interest in articulatorily and perceptually driven markedness in phonological research. To some researchers, the cross-linguistic prevalence of such markedness relations is indication that synchronic phonological grammar should include phonetic details. However, there are at least two distinct ways in which phonetics can be incorporated in an optimality-theoretic grammar: traditional constraint domination and Flemming (2001)’s proposal that the costs of constraint violations should be weighted and summed. I argue that constraint weighting is unnecessary as an innovation in Optimality Theory. The arguments are twofold. First, using constraint families with intrinsic rankings, constraint domination formally predicts the same range of phonological realisations as constraint weighting. Second, with proper constraint definitions and rankings, both the additive effect and the locus effect predicted by constraint weighting can be replicated in constraint domination.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint weighting as linear programming

In constraint-based phonology right now, constraint ranking is the dominant mode, and phonologists have achieved a wealth of results with such systems and about them. Phonological theories based in constraint weighting have received comparatively less attention. It would be a mistake to conclude from this neglect, though, that weighting is not a viable alternative to ranking. Weighting systems ...

متن کامل

Anything Goes

Representing OT hierarchies in terms of weighted sums of violations requires in the general case exponential growth of weights; and any such weight system will only work for finite fragments of grammars in which the quantity of violations incurred by optima does not grow without bound (typically, those fragments in which input size is bounded). This conclusion is based on a worst-case analysis,...

متن کامل

Constraint Conjunction versus Grounded Constraint Subhierarchies in Optimality Theory

A central assumption of classical Optimality Theory (Prince and Smolensky 1993) is that constraint domination is strict. That is, if constraint A outranks constraints B and C (A >> B, C), then a candidate output that violates A can never be favored over one that satisfies A but violates B and/or C, no matter how many violations of B and C occur. Tableau (1) illustrates the familiar scenario of ...

متن کامل

Tactical and operational planning for socially responsible fresh agricultural supply chain

Addressing an integrated decision-making structure for planting and harvesting scheduling may lead to more realistic, accurate, and efficient decision in fresh product supply chain. This study aims to develop an integrated bi-objective tactical and operational planning model for producing and distributing fresh crops. The first objective of the model is to maximize total revenue of supply chain...

متن کامل

HG Has No Computational Advantages over OT

The peculiar property of Optimality Theory (OT) is that it uses constraint ranking and thus enforces strict domination, according to which the highest ranked relevant constraint “takes it all”; see Prince & Smolensky (2004). Because of this property, OT looks prima facie like an exotic combinatorial framework. Exotic in the sense that it does not seem to have any close correspondent within core...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007